منابع مشابه
A Heuristic and Dynamic Multicast Router Algorithm based on QoS
As the internet developing rapidly, new requirements, such as video on demand and video conference are emerging. QoS based Multicast router arouses widely attention. This paper proposes a Delay-constrained Dynamic Multicast Routing Heuristic Algorithm (DDMRH) with combining FLSPT algorithm and the greedy idea. The emulation test shows that DDMRH algorithm can meet the demand of multicast applic...
متن کاملA robust channel router
A new robust channel router, with very simple heuristics, is being introduced. It is able to handle two-layer channels, three-layer channels with two horizontal layers and one vertical layer (HVH), and three-layer channels with two vertical layers and one horizontal layer 0. This router uses the horizontal layers only for horizontal wires, and the vertical layers only for vertical wires. It is ...
متن کاملA multiple layer contour-based gridless channel router
With the continuing advances of VLSI-technology, multiple layer channel routing has become increasingly important. A new n-layer gridless channel router is presented. Instead of the commonly employed grid it uses a set of contours as routing framework. The contours together with a set of reserved areas prevent short circuits and ensure routability of all nets. A compact routing can he expected ...
متن کاملA Parallel Graph Coloring Heuristic
The problem of computing good graph colorings arises in many diverse applications , such as in the estimation of sparse Jacobians and in the development of eecient, parallel iterative methods for solving sparse linear systems. In this paper we present an asynchronous graph coloring heuristic well suited to distributed memory parallel computers. We present experimental results obtained on an Int...
متن کاملA graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integration
سال: 1988
ISSN: 0167-9260
DOI: 10.1016/0167-9260(88)90005-3